A shifting algorithm for constrained min-max partition on trees

Approximation Algorithms for Min-Max Tree Partition

We consider the problem of partitioning the node set of a graph into p equal sized subsets. The objective is to minimize the maximum length, over these subsets, of a minimum spanning tree. We show that no polynomial algorithm with bounded Ž 2 . error ratio can be given for the problem unless P s NP. We present an O n time algorithm for the problem, where n is the number of nodes in the graph. A...

A smoothing algorithm for finite min-max-min problems

We generalize a smoothing algorithm for finite min–max to finite min– max–min problems. We apply a smoothing technique twice, once to eliminate the inner min operator and once to eliminate the max operator. In mini–max problems, where only the max operator is eliminated, the approximation function is decreasing with respect to the smoothing parameter. Such a property is convenient to establish ...

A Hybrid Min-min Max-min Algorithm with Improved Performance

The high cost of supercomputers and the need for large-scale computational resources has led to the development of network of computational resources known as Grid. To better use tremendous capabilities of this large scale distributed system, effective and efficient scheduling algorithms are needed. Many such algorithms have been designed and implemented. We introduce a new scheduling algorithm...

A powerful global router: based on Steiner min-max trees

We study global routing of multiterminal nets. We propose a new global router; each step consists of finding a tree, called Steiner min-max tree, that is, a Steiner tree with maximum-weight edge minimized (real vertices represent channels containing terminals of a net, Steiner vertices represent intermediate channels, and weights correspond to densities). We propose an effient algorithm for obt...

A Lagrange Multiplier Method for Certain Constrained Min-Max Problems